On Scaling of Fuzzy FCA to Pattern Structures
نویسندگان
چکیده
FCA is a mathematical formalism having many applications in data mining and knowledge discovery. Originally it deals with binary data tables. However, there is a number of extensions that enrich standard FCA. In this paper we consider two important extensions: fuzzy FCA and pattern structures, and discuss the relation between them. In particular we introduce a scaling procedure that enables representing a fuzzy context as a pattern structure. Studying the relation between different extensions of FCA is of high importance, since it allows migrating methods from one extension to another. Moreover, it allows for more simple implementation of different extensions within a software.
منابع مشابه
How Fuzzy FCA and Pattern Structures are Connected?
FCA is a mathematical formalism having many applications in data mining and knowledge discovery. Originally it deals with binary data tables. However, there is a number of extensions that enrich standard FCA. In this paper we consider two important extensions: fuzzy FCA and pattern structures, and discuss the relation between them. In particular we introduce a scaling procedure that enables rep...
متن کاملMining gene expression data with pattern structures in formal concept analysis
This paper addresses the important problem of efficiently mining numerical data with formal concept analysis (FCA). Classically, the only way to apply FCA is to binarize the data, thanks to a so-called scaling procedure. This may either involve loss of information, or produce large and dense binary data known as hard to process. In the context of gene expression data analysis, we propose and co...
متن کاملFuzzy Cellular Automata for Modeling Pattern Classifier
This paper investigates the application of the computational model of Cellular Automata (CA) for pattern classification of real valued data. A special class of CA referred to as Fuzzy CA (FCA) is employed to design the pattern classifier. It is a natural extension of conventional CA, which operates on binary string employing boolean logic as next state function of a cell. By contrast, FCA emplo...
متن کاملComputing Functional Dependencies with Pattern Structures
The treatment of many-valued data with FCA has been achieved by means of scaling. This method has some drawbacks, since the size of the resulting formal contexts depends usually on the number of different values that are present in a table, which can be very large. Pattern structures have been proved to deal with many-valued data, offering a viable and sound alternative to scaling in order to r...
متن کاملPattern Structures for Analyzing Complex Data
For data given by binary object-attribute datatables Formal Concept Analysis (FCA) provides with a means for both convenient computing hierarchies of object classes and dependencies between sets of attributes used for describing objects. In case of data more complex than binary to apply FCA techniques, one needs scaling (binarizing) data. Pattern structures propose a direct way of processing co...
متن کامل